package com.lwx.leetcode.offer.middile;

public class Offer13 {
    private int m,n;
    public int movingCount(int m, int n, int k) {
        this.m = m;
        this.n = n;
        //如果i,j不能到达，那么i,j向下，i,j向右的所有格子都到达不了
        //如果i,j能到达，那么i,j对称的区域也可以到达
        boolean[][] visited = new boolean[m][n];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
//                if(){
//                    visited[i][j] = true;
//                }
            }

        }
        return 0;
    }

    public boolean inArea(int x, int y){
//        return x>=0 &&
        return true;
    }

}
